Solving Robot Path Planning Problem Using Ant Colony Optimisation (ACO) Approach
نویسندگان
چکیده
منابع مشابه
Solving a unique Shortest Path problem using Ant Colony Optimisation
Ant Colony Optimisation (ACO) has in the past proved suitable to solve many optimisation problems. This research explores the ability of the ACO algorithm to balance two quality metrics (length and cost) in its decision making process. Results are given for a preliminary investigation based on a series of shortest path problems. It is concluded that, for these problems at least, the solution qu...
متن کاملSolving the Airline Recovery Problem By Using Ant Colony Optimization
In this paper an Ant Colony (ACO) algorithm is developed to solve aircraft recovery while considering disrupted passengers as part of objective function cost. By defining the recovery scope, the solution always guarantees a return to the original aircraft schedule as soon as possible which means least changes to the initial schedule and ensures that all downline affects of the disruption are ...
متن کاملSolving Path Planning Problem by an ACO-PSO Hybrid Algorithm
An ACO-PSO Hybrid Algorithm Solving Path Planning Problem based on Swarm Intelligence (SI) is proposed. The problem first is described and some corresponding definitions are presented. Ant colony optimization (ACO) is used to establish the corresponding solution, and some material algorithm steps are set out. Particle swarm optimization (PSO) is applied to optimize the parameters in ACO, and pa...
متن کاملRobot Path Planning using An Ant Colony Optimization Approach: A Survey
Path planning problem, is a challenging topic in robotics. Indeed, a significant amount of research has been devoted to this problem in recent years. The ant colony optimization algorithm is another approach to solve this problem. Each ant drops a quantity of artificial pheromone on every point that the ant passes through. This pheromone simply changes the probability that the next ant becomes ...
متن کاملAnt Colony Optimization Algorithm for Robot Path Planning
-In this article two different optimization algorithms are presented to solve the deficiency of ant colony algorithm such as slow convergence rate and easy to fall into local optimum. This method based on Max-Min Ant System, established an adaptive model for pheromone evaporation coefficient adjusted adaptively and avoided the ants falling into local optimum. At the same time, this optimization...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scientific Research Journal
سال: 2009
ISSN: 2289-649X,1675-7009
DOI: 10.24191/srj.v6i1.5638